Inaugural conference of the international linear algebra society 12–15 August 1989 Brigham Young University, Provo, Utah, USA
نویسندگان
چکیده
منابع مشابه
Brigham Young University
In a previous paper it was shown that reducing the amount of glitches in digital designs can significantly reduce the amount of dynamic power consumption. Pipelined multipliers and a bit-serial multiplier design were used to show this. The paper failed to mention how much of the dynamic power consumption was due to the clock distribution. Also the only digitserial multiplier digit size investig...
متن کاملLinear Algebra . A publication of the International Linear Algebra Society
Nonnegative nilpotent lower triangular completions of a nonnegative nilpotent matrix are studied. It is shown that for every natural number between the index of the matrix and its order, there exists a completion that has this number as its index. A similar result is obtained for the rank. However, unlike the case of complex completions of complex matrices, it is proved that for every nonincrea...
متن کاملPerturbed disks get shocked: Binary black hole merger effects on accretion disks
Miguel Megevand, Matthew Anderson, Juhan Frank, Eric W. Hirschmann, Luis Lehner, Steven L. Liebling, Patrick M. Motl, and David Neilsen Department of Physics and Astronomy, Louisiana State University, Baton Rouge, Louisiana 70803-4001, USA Department of Mathematics, Brigham Young University, Provo, Utah 84602, USA Department of Physics and Astronomy, Brigham Young University, Provo, Utah 84602,...
متن کاملSimulating binary neutron stars: Dynamics and gravitational waves
Matthew Anderson, Eric W. Hirschmann, Luis Lehner, Steven L. Liebling, Patrick M. Motl, David Neilsen, Carlos Palenzuela, and Joel E. Tohline Department of Physics and Astronomy, Louisiana State University, Baton Rouge, Louisiana 70803-4001, USA Department of Physics and Astronomy, Brigham Young University, Provo, Utah 84602, USA Department of Physics, Long Island University–C.W. Post Campus, B...
متن کاملInternational Conference on Linear Algebra and its Applications
The distance matrix of a simple graph G is D(G) = (di,j), where di,j is the distance between the ith and jth vertices of G. The greatest eigenvalue λ1 of D(G) is called the distance spectral radius of the graph G and is denoted by λ1(G). A simple connected graph G is called a 2-partite distance regular graph if there exists a partition V1 ∪V2 of the vertex set of G such that for i = 1, 2 and an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1991
ISSN: 0024-3795
DOI: 10.1016/0024-3795(91)90185-y